Clustering cliques for graph-based summarization of the biomedical research literature

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Abstraction Summarization For Managing The Biomedical Research Literature

ion Summarization for Managing the Biomedical Research Literature Marcelo Fiszman Thomas C. Rindflesch Halil Kilicoglu Lister Hill National Center for Biomedical Communications National Library of Medicine Bethesda, MD 20894 {fiszman|tcr|halil}@nlm.nih.gov

متن کامل

Towards Citation-Based Summarization of Biomedical Literature

Citation-based summarization is a form of technical summarization that uses citations to an article to form its summary. In biomedical literature, citations by themselves are not reliable to be used for summary as they fail to consider the context of the findings in the referenced article. One way to remedy such problem is to link citations to the related text spans in the reference article. Th...

متن کامل

Systematic literature review of fuzzy logic based text summarization

Information Overloadrq  is not a new term but with the massive development in technology which enables anytime, anywhere, easy and unlimited access; participation & publishing of information has consequently escalated its impact. Assisting userslq    informational searches with reduced reading surfing time by extracting and evaluating accurate, authentic & relevant information are the primary c...

متن کامل

Graph Hybrid Summarization

One solution to process and analysis of massive graphs is summarization. Generating a high quality summary is the main challenge of graph summarization. In the aims of generating a summary with a better quality for a given attributed graph, both structural and attribute similarities must be considered. There are two measures named density and entropy to evaluate the quality of structural and at...

متن کامل

Graph Clustering Using Distance-k Cliques

Identifying the natural clusters of nodes in a graph and treating them as supernodes or metanodes for a higher level graph (or an abstract graph) is a technique used for the reduction of visual complexity of graphs with a large number of nodes. In this paper we report on the implementation of a clustering algorithm based on the idea of distance-k cliques, a generalization of the idea of the cli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BMC Bioinformatics

سال: 2013

ISSN: 1471-2105

DOI: 10.1186/1471-2105-14-182